Constraint 2 is relaxed
Constraint 3 is not relaxed
Constraint 4 is not relaxed
Constraint 5 is relaxed
Constraint 6 is relaxed
The time to read the input and initialise the problem = 1890 ms

Iteration 1
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 109 ms
The lower bound solution is:
z = -15351.800000 + 1954.000000 = -13397.800000
The time to read the lower bound solution = 0 ms
The time to compute the upper bound = 31 ms
The upper bound solution is:
z = 330141.363640
The optimal solution has not been found yet.

Iteration 2
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 15 ms
The lower bound solution is:
z = -33420.950600 + 27719.437273 = -5701.513327
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 32 ms
The time to compute the upper bound = 0 ms
The upper bound solution is:
z = 201266.494350
The time to read the upper bound solution = 15 ms
The optimal solution has not been found yet.

Iteration 3
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = -23273.260987 + 34604.385637 = 11331.124650
The time to read the lower bound solution = 15 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 31 ms
The time to compute the upper bound = 47 ms
The upper bound solution is:
z = 67844.920510
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 4
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = -21498.547022 + 35052.208301 = 13553.661279
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 31 ms
The time to compute the upper bound = 0 ms
The upper bound solution is:
z = 47358.920510
The time to read the upper bound solution = 15 ms
The optimal solution has not been found yet.

Iteration 5
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = -23922.315739 + 35550.835571 = 11628.519832
The time to read the lower bound solution = 15 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 0 ms
The time to compute the upper bound = 16 ms
The upper bound solution is:
z = 65763.198157
The time to read the upper bound solution = 16 ms
The optimal solution has not been found yet.

Iteration 6
The time to create lower bound problem = 0 ms
The time to compute the lower bound = 15 ms
The lower bound solution is:
z = -26831.848591 + 36363.709699 = 9531.861108
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 16 ms
The time to compute the upper bound = 15 ms
The upper bound solution is:
z = 75808.608942
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 7
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = -49313.828639 + 39793.738827 = -9520.089812
The time to read the lower bound solution = 15 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 16 ms
The time to compute the upper bound = 16 ms
The upper bound solution is:
z = 47962.162254
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 8
The time to create lower bound problem = 15 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = -51279.174996 + 39911.320754 = -11367.854242
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 47962.162254
The optimal solution has not been found yet.

Iteration 9
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = -86929.006835 + 44803.853569 = -42125.153266
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 47962.162254
The optimal solution has not been found yet.

Iteration 10
The time to create lower bound problem = 15 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = -91204.139050 + 46266.427643 = -44937.711407
The time to read the lower bound solution = 16 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 16 ms
The time to compute the upper bound = 15 ms
The upper bound solution is:
z = 47444.162254
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 11
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 15 ms
The lower bound solution is:
z = -92844.374740 + 47113.907500 = -45730.467240
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 47444.162254
The optimal solution has not been found yet.

Iteration 12
The time to create lower bound problem = 32 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = -97208.434884 + 48005.795167 = -49202.639717
The time to read the lower bound solution = 15 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 47444.162254
The optimal solution has not been found yet.

Iteration 13
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = -98684.398291 + 49453.732148 = -49230.666143
The time to read the lower bound solution = 15 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 47444.162254
The optimal solution has not been found yet.

Iteration 14
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 15 ms
The lower bound solution is:
z = -100246.290630 + 48212.271617 = -52034.019013
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 47444.162254
The optimal solution has not been found yet.

Iteration 15
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = -102753.983950 + 49637.912018 = -53116.071932
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 47444.162254
The optimal solution has not been found yet.

Iteration 16
The time to create lower bound problem = 15 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = -105008.646980 + 50682.488436 = -54326.158544
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 47444.162254
The optimal solution has not been found yet.

Iteration 17
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 15 ms
The lower bound solution is:
z = -106575.469360 + 51518.189589 = -55057.279771
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 16 ms
The upper bound solution is:
z = 47444.162254
The optimal solution has not been found yet.

Iteration 18
The time to create lower bound problem = 47 ms
The time to compute the lower bound = 47 ms
The lower bound solution is:
z = -108249.194120 + 51623.581043 = -56625.613077
The time to read the lower bound solution = 15 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 47444.162254
The optimal solution has not been found yet.

Iteration 19
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = -115412.029040 + 53708.894295 = -61703.134745
The time to read the lower bound solution = 15 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 47444.162254
The optimal solution has not been found yet.

Iteration 20
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = -118611.696840 + 55679.817616 = -62931.879224
The time to read the lower bound solution = 15 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 47444.162254
The optimal solution has not been found yet.

Iteration 21
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = -120552.955260 + 57265.560562 = -63287.394698
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 47444.162254
The optimal solution has not been found yet.

Iteration 22
The time to create lower bound problem = 15 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = -123987.605720 + 59419.927019 = -64567.678701
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 47444.162254
The optimal solution has not been found yet.

Iteration 23
The time to create lower bound problem = 15 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = -125841.096890 + 60779.220052 = -65061.876838
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 16 ms
The time to compute the upper bound = 15 ms
The upper bound solution is:
z = 46639.162254
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 24
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = -127724.086830 + 61404.741708 = -66319.345122
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 46639.162254
The optimal solution has not been found yet.

Iteration 25
The time to create lower bound problem = 15 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = -129274.549640 + 62573.579263 = -66700.970377
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 46639.162254
The optimal solution has not been found yet.

Iteration 26
The time to create lower bound problem = 15 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = -131945.829250 + 63927.844499 = -68017.984751
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 46639.162254
The optimal solution has not been found yet.

Iteration 27
The time to create lower bound problem = 31 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = -137804.217170 + 65714.200452 = -72090.016718
The time to read the lower bound solution = 16 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 46639.162254
The optimal solution has not been found yet.

Iteration 28
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = -140232.696220 + 66961.569720 = -73271.126500
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 46639.162254
The optimal solution has not been found yet.

Iteration 29
The time to create lower bound problem = 15 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = -143996.108540 + 69327.345696 = -74668.762844
The time to read the lower bound solution = 15 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 46639.162254
The optimal solution has not been found yet.

Iteration 30
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = -159692.433020 + 72055.431710 = -87637.001310
The time to read the lower bound solution = 16 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 15 ms
The time to compute the upper bound = 0 ms
The upper bound solution is:
z = 47962.162254
The time to read the upper bound solution = 16 ms
The optimal solution has not been found yet.

Iteration 31
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = -161372.065090 + 72965.773771 = -88406.291319
The time to read the lower bound solution = 15 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 47962.162254
The optimal solution has not been found yet.

Iteration 32
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 15 ms
The lower bound solution is:
z = -162880.201970 + 73453.698896 = -89426.503074
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 47962.162254
The optimal solution has not been found yet.

Iteration 33
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = -164456.384570 + 74151.998078 = -90304.386492
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 47962.162254
The optimal solution has not been found yet.

Iteration 34
The time to create lower bound problem = 15 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = -165895.498320 + 74454.068290 = -91441.430030
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 47962.162254
The optimal solution has not been found yet.

Iteration 35
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 15 ms
The lower bound solution is:
z = -167720.903970 + 75181.571196 = -92539.332774
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 16 ms
The time to compute the upper bound = 15 ms
The upper bound solution is:
z = 47444.162254
The time to read the upper bound solution = 16 ms
The optimal solution has not been found yet.

Iteration 36
The time to create lower bound problem = 31 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = -169940.593590 + 75954.047297 = -93986.546293
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 47444.162254
The optimal solution has not been found yet.

Iteration 37
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 15 ms
The lower bound solution is:
z = -171593.881230 + 74412.458560 = -97181.422670
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 16 ms
The time to compute the upper bound = 15 ms
The upper bound solution is:
z = 45632.162254
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 38
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = -173640.723770 + 74304.984808 = -99335.738962
The time to read the lower bound solution = 16 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 45632.162254
The optimal solution has not been found yet.

Iteration 39
The time to create lower bound problem = 15 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = -176024.688550 + 74199.991495 = -101824.697055
The time to read the lower bound solution = 16 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 45632.162254
The optimal solution has not been found yet.

Iteration 40
The time to create lower bound problem = 15 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = -177479.197640 + 74366.106975 = -103113.090665
The time to read the lower bound solution = 16 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 0 ms
The time to compute the upper bound = 15 ms
The upper bound solution is:
z = 44583.143535
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 41
The time to create lower bound problem = 32 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = -179178.055920 + 74159.370845 = -105018.685075
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 44583.143535
The optimal solution has not been found yet.

Iteration 42
The time to create lower bound problem = 31 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = -180982.435700 + 73818.610260 = -107163.825440
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 44583.143535
The optimal solution has not been found yet.

Iteration 43
The time to create lower bound problem = 15 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = -183404.405170 + 72979.444553 = -110424.960617
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 44583.143535
The optimal solution has not been found yet.

Iteration 44
The time to create lower bound problem = 15 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = -185638.364060 + 73090.689147 = -112547.674913
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 44583.143535
The optimal solution has not been found yet.

Iteration 45
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 15 ms
The lower bound solution is:
z = -188001.037880 + 72612.906515 = -115388.131365
The time to read the lower bound solution = 16 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 0 ms
The time to compute the upper bound = 16 ms
The upper bound solution is:
z = 60702.074074
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 46
The time to create lower bound problem = 15 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = -193848.319930 + 68613.974590 = -125234.345340
The time to read the lower bound solution = 15 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 32 ms
The time to compute the upper bound = 15 ms
The upper bound solution is:
z = 46768.530325
The time to read the upper bound solution = 16 ms
The optimal solution has not been found yet.

Iteration 47
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = -196073.062590 + 67785.488531 = -128287.574059
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 15 ms
The time to compute the upper bound = 16 ms
The upper bound solution is:
z = 58461.923810
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 48
The time to create lower bound problem = 15 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = -200247.995160 + 68902.534321 = -131345.460839
The time to read the lower bound solution = 16 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 58461.923810
The optimal solution has not been found yet.

Iteration 49
The time to create lower bound problem = 15 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = -205047.046680 + 70632.319740 = -134414.726940
The time to read the lower bound solution = 16 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 0 ms
The time to compute the upper bound = 16 ms
The upper bound solution is:
z = 60702.074074
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 50
The time to create lower bound problem = 15 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = -207969.604380 + 72399.388717 = -135570.215663
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 15 ms
The time to compute the upper bound = 16 ms
The upper bound solution is:
z = 58461.923810
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 51
The time to create lower bound problem = 31 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = -210203.998150 + 73165.774809 = -137038.223341
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 32 ms
The time to compute the upper bound = 0 ms
The upper bound solution is:
z = 60702.074074
The time to read the upper bound solution = 15 ms
The optimal solution has not been found yet.

Iteration 52
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = -213206.035970 + 73844.836912 = -139361.199058
The time to read the lower bound solution = 15 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 0 ms
The time to compute the upper bound = 16 ms
The upper bound solution is:
z = 106618.703230
The time to read the upper bound solution = 16 ms
The optimal solution has not been found yet.

Iteration 53
The time to create lower bound problem = 15 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = -215744.306840 + 74347.342088 = -141396.964752
The time to read the lower bound solution = 16 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 0 ms
The time to compute the upper bound = 16 ms
The upper bound solution is:
z = 65763.198157
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 54
The time to create lower bound problem = 15 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = -217606.930920 + 74029.182223 = -143577.748697
The time to read the lower bound solution = 15 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 16 ms
The time to compute the upper bound = 0 ms
The upper bound solution is:
z = 77783.991590
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 55
The time to create lower bound problem = 47 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = -219950.031090 + 74070.449027 = -145879.582063
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 15 ms
The time to compute the upper bound = 0 ms
The upper bound solution is:
z = 100670.453330
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 56
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 15 ms
The lower bound solution is:
z = -226563.474130 + 75854.648115 = -150708.826015
The time to read the lower bound solution = 16 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 16 ms
The time to compute the upper bound = 0 ms
The upper bound solution is:
z = 58461.923810
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 57
The time to create lower bound problem = 15 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = -229869.354520 + 77126.857151 = -152742.497369
The time to read the lower bound solution = 16 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 58461.923810
The optimal solution has not been found yet.

Iteration 58
The time to create lower bound problem = 15 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = -233178.811710 + 78564.229153 = -154614.582557
The time to read the lower bound solution = 16 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 15 ms
The time to compute the upper bound = 16 ms
The upper bound solution is:
z = 100670.453330
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 59
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 15 ms
The lower bound solution is:
z = -237065.114970 + 80008.504212 = -157056.610758
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 100670.453330
The optimal solution has not been found yet.

Iteration 60
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = -240553.815060 + 80780.969633 = -159772.845427
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 100670.453330
The optimal solution has not been found yet.

Iteration 61
The time to create lower bound problem = 15 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = -244135.707380 + 82125.276592 = -162010.430788
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 100670.453330
The optimal solution has not been found yet.

Iteration 62
The time to create lower bound problem = 15 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = -250724.519770 + 83984.274481 = -166740.245289
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 16 ms
The time to compute the upper bound = 0 ms
The upper bound solution is:
z = 65763.198157
The time to read the upper bound solution = 15 ms
The optimal solution has not been found yet.

Iteration 63
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = -253239.707020 + 84503.464289 = -168736.242731
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 65763.198157
The optimal solution has not been found yet.

Iteration 64
The time to create lower bound problem = 15 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = -256088.037000 + 84724.327663 = -171363.709337
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 31 ms
The time to compute the upper bound = 0 ms
The upper bound solution is:
z = 58461.923810
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 65
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 15 ms
The lower bound solution is:
z = -259240.810290 + 84302.737046 = -174938.073244
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 16 ms
The time to compute the upper bound = 16 ms
The upper bound solution is:
z = 60702.074074
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 66
The time to create lower bound problem = 15 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = -261826.834250 + 84655.420302 = -177171.413948
The time to read the lower bound solution = 15 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 16 ms
The time to compute the upper bound = 0 ms
The upper bound solution is:
z = 65763.198157
The time to read the upper bound solution = 16 ms
The optimal solution has not been found yet.

Iteration 67
The time to create lower bound problem = 15 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = -281629.751880 + 85875.837204 = -195753.914676
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 16 ms
The time to compute the upper bound = 15 ms
The upper bound solution is:
z = 47962.162254
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 68
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 15 ms
The lower bound solution is:
z = -285417.288220 + 86507.104268 = -198910.183952
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 47962.162254
The optimal solution has not been found yet.

Iteration 69
The time to create lower bound problem = 32 ms
The time to compute the lower bound = 15 ms
The lower bound solution is:
z = -287915.719360 + 87614.626572 = -200301.092788
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 16 ms
The time to compute the upper bound = 16 ms
The upper bound solution is:
z = 47444.162254
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 70
The time to create lower bound problem = 15 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = -288556.670110 + 88615.773194 = -199940.896916
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 47444.162254
The optimal solution has not been found yet.

Iteration 71
The time to create lower bound problem = 32 ms
The time to compute the lower bound = 93 ms
The lower bound solution is:
z = -293483.898750 + 89883.693164 = -203600.205586
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 47444.162254
The optimal solution has not been found yet.

Iteration 72
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = -299049.932700 + 91864.111840 = -207185.820860
The time to read the lower bound solution = 15 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 16 ms
The time to compute the upper bound = 16 ms
The upper bound solution is:
z = 50142.162254
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 73
The time to create lower bound problem = 31 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = -303813.565380 + 94225.625774 = -209587.939606
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 50142.162254
The optimal solution has not been found yet.

Iteration 74
The time to create lower bound problem = 31 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = -306743.093010 + 95892.357874 = -210850.735136
The time to read the lower bound solution = 15 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 0 ms
The time to compute the upper bound = 32 ms
The upper bound solution is:
z = 50271.530325
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 75
The time to create lower bound problem = 15 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = -310131.518820 + 97039.988841 = -213091.529979
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 50271.530325
The optimal solution has not been found yet.

Iteration 76
The time to create lower bound problem = 15 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = -313112.264780 + 97755.251364 = -215357.013416
The time to read the lower bound solution = 16 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 50271.530325
The optimal solution has not been found yet.

Iteration 77
The time to create lower bound problem = 15 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = -326648.319440 + 99955.682453 = -226692.636987
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 16 ms
The time to compute the upper bound = 15 ms
The upper bound solution is:
z = 50660.162254
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 78
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 15 ms
The lower bound solution is:
z = -331938.651600 + 101419.586892 = -230519.064708
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 50660.162254
The optimal solution has not been found yet.

Iteration 79
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = -337440.210600 + 102815.671840 = -234624.538760
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 15 ms
The time to compute the upper bound = 16 ms
The upper bound solution is:
z = 50142.162254
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 80
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 15 ms
The lower bound solution is:
z = -340369.932020 + 103476.795463 = -236893.136557
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 50142.162254
The optimal solution has not been found yet.

Iteration 81
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 15 ms
The lower bound solution is:
z = -343492.609190 + 104223.737715 = -239268.871475
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 16 ms
The time to compute the upper bound = 16 ms
The upper bound solution is:
z = 48086.143535
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 82
The time to create lower bound problem = 31 ms
The time to compute the lower bound = 31 ms
The lower bound solution is:
z = -345067.456180 + 104650.916093 = -240416.540087
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 48086.143535
The optimal solution has not been found yet.

Iteration 83
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 15 ms
The lower bound solution is:
z = -346429.033740 + 104984.741799 = -241444.291941
The time to read the lower bound solution = 16 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 48086.143535
The optimal solution has not been found yet.

Iteration 84
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = -347954.720710 + 105524.811409 = -242429.909301
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 48086.143535
The optimal solution has not been found yet.

Iteration 85
The time to create lower bound problem = 31 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = -349248.416050 + 105783.954579 = -243464.461471
The time to read the lower bound solution = 31 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 48086.143535
The optimal solution has not been found yet.

Iteration 86
The time to create lower bound problem = 47 ms
The time to compute the lower bound = 31 ms
The lower bound solution is:
z = -350955.504950 + 106179.321777 = -244776.183173
The time to read the lower bound solution = 16 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 15 ms
The time to compute the upper bound = 16 ms
The upper bound solution is:
z = 51785.986104
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 87
The time to create lower bound problem = 15 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = -352775.033100 + 106805.708986 = -245969.324114
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 51785.986104
The optimal solution has not been found yet.

Iteration 88
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 15 ms
The lower bound solution is:
z = -355626.148670 + 107566.843654 = -248059.305016
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 16 ms
The time to compute the upper bound = 16 ms
The upper bound solution is:
z = 48086.143535
The time to read the upper bound solution = 15 ms
The optimal solution has not been found yet.

Iteration 89
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = -357065.468270 + 108101.657352 = -248963.810918
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 16 ms
The time to compute the upper bound = 0 ms
The upper bound solution is:
z = 51785.986104
The time to read the upper bound solution = 16 ms
The optimal solution has not been found yet.

Iteration 90
The time to create lower bound problem = 15 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = -358798.796360 + 108755.837655 = -250042.958705
The time to read the lower bound solution = 16 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 51785.986104
The optimal solution has not been found yet.

Iteration 91
The time to create lower bound problem = 0 ms
The time to compute the lower bound = 31 ms
The lower bound solution is:
z = -360355.850050 + 109332.337444 = -251023.512606
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 51785.986104
The optimal solution has not been found yet.

Iteration 92
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 15 ms
The lower bound solution is:
z = -361689.229450 + 109607.198011 = -252082.031439
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 51785.986104
The optimal solution has not been found yet.

Iteration 93
The time to create lower bound problem = 32 ms
The time to compute the lower bound = 15 ms
The lower bound solution is:
z = -364339.756040 + 109584.523789 = -254755.232251
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 51785.986104
The optimal solution has not been found yet.

Iteration 94
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = -366776.369230 + 110423.032775 = -256353.336455
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 15 ms
The time to compute the upper bound = 0 ms
The upper bound solution is:
z = 48086.143535
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 95
The time to create lower bound problem = 15 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = -368652.449720 + 110763.301112 = -257889.148608
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 31 ms
The time to compute the upper bound = 16 ms
The upper bound solution is:
z = 51785.986104
The time to read the upper bound solution = 16 ms
The optimal solution has not been found yet.

Iteration 96
The time to create lower bound problem = 15 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = -370778.716450 + 111711.162071 = -259067.554379
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 51785.986104
The optimal solution has not been found yet.

Iteration 97
The time to create lower bound problem = 15 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = -372556.238920 + 112449.914478 = -260106.324442
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 51785.986104
The optimal solution has not been found yet.

Iteration 98
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 15 ms
The lower bound solution is:
z = -374158.524380 + 112869.988219 = -261288.536161
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 51785.986104
The optimal solution has not been found yet.

Iteration 99
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = -376152.638690 + 113379.329762 = -262773.308928
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 51785.986104
The optimal solution has not been found yet.

Iteration 100
The time to create lower bound problem = 15 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = -377577.604330 + 113823.929288 = -263753.675042
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 51785.986104
The optimal solution has not been found yet.

Iteration 101
The time to create lower bound problem = 15 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = -379011.134810 + 114052.322584 = -264958.812226
The time to read the lower bound solution = 16 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 51785.986104
The optimal solution has not been found yet.

Iteration 102
The time to create lower bound problem = 15 ms
The time to compute the lower bound = 32 ms
The lower bound solution is:
z = -380530.452820 + 114169.137048 = -266361.315772
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 51785.986104
The optimal solution has not been found yet.

Iteration 103
The time to create lower bound problem = 15 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = -382255.327100 + 113837.154400 = -268418.172700
The time to read the lower bound solution = 15 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 51785.986104
The optimal solution has not been found yet.

Iteration 104
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = -383689.291750 + 113976.217956 = -269713.073794
The time to read the lower bound solution = 16 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 51785.986104
The optimal solution has not been found yet.

Iteration 105
The time to create lower bound problem = 15 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = -385173.420100 + 113616.024304 = -271557.395796
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 51785.986104
The optimal solution has not been found yet.

Iteration 106
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 15 ms
The lower bound solution is:
z = -386403.364340 + 112744.303199 = -273659.061141
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 51785.986104
The optimal solution has not been found yet.

Iteration 107
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 15 ms
The lower bound solution is:
z = -396882.536180 + 114680.916950 = -282201.619230
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 16 ms
The time to compute the upper bound = 16 ms
The upper bound solution is:
z = 50142.162254
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 108
The time to create lower bound problem = 31 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = -398377.609390 + 115373.758502 = -283003.850888
The time to read the lower bound solution = 16 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 15 ms
The time to compute the upper bound = 0 ms
The upper bound solution is:
z = 49093.143535
The time to read the upper bound solution = 16 ms
The optimal solution has not been found yet.

Iteration 109
The time to create lower bound problem = 15 ms
The time to compute the lower bound = 32 ms
The lower bound solution is:
z = -399751.603740 + 115729.306100 = -284022.297640
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 49093.143535
The optimal solution has not been found yet.

Iteration 110
The time to create lower bound problem = 15 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = -407513.472920 + 117306.282438 = -290207.190482
The time to read the lower bound solution = 16 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 0 ms
The time to compute the upper bound = 15 ms
The upper bound solution is:
z = 50142.162254
The time to read the upper bound solution = 16 ms
The optimal solution has not been found yet.

Iteration 111
The time to create lower bound problem = 15 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = -408784.813720 + 117857.487252 = -290927.326468
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 50142.162254
The optimal solution has not been found yet.

Iteration 112
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 15 ms
The lower bound solution is:
z = -410679.449450 + 118775.189012 = -291904.260438
The time to read the lower bound solution = 16 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 50142.162254
The optimal solution has not been found yet.

Iteration 113
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 31 ms
The lower bound solution is:
z = -413340.011940 + 119170.767016 = -294169.244924
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 50142.162254
The optimal solution has not been found yet.

Iteration 114
The time to create lower bound problem = 15 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = -415202.506760 + 120034.964923 = -295167.541837
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 50142.162254
The optimal solution has not been found yet.

Iteration 115
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 15 ms
The lower bound solution is:
z = -416748.411790 + 120873.363266 = -295875.048524
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 16 ms
The time to compute the upper bound = 16 ms
The upper bound solution is:
z = 49135.162254
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 116
The time to create lower bound problem = 15 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = -418028.340510 + 121354.182583 = -296674.157927
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 49135.162254
The optimal solution has not been found yet.

Iteration 117
The time to create lower bound problem = 15 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = -422237.654980 + 122751.278206 = -299486.376774
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 16 ms
The time to compute the upper bound = 0 ms
The upper bound solution is:
z = 50142.162254
The time to read the upper bound solution = 15 ms
The optimal solution has not been found yet.

Iteration 118
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = -425175.944330 + 124014.601993 = -301161.342337
The time to read the lower bound solution = 16 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 50142.162254
The optimal solution has not been found yet.

Iteration 119
The time to create lower bound problem = 31 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = -429654.533490 + 125334.160026 = -304320.373464
The time to read the lower bound solution = 15 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 16 ms
The time to compute the upper bound = 16 ms
The upper bound solution is:
z = 50660.162254
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 120
The time to create lower bound problem = 15 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = -432530.757370 + 126327.260651 = -306203.496719
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 16 ms
The time to compute the upper bound = 15 ms
The upper bound solution is:
z = 50142.162254
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 121
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 15 ms
The lower bound solution is:
z = -433729.169150 + 127118.879729 = -306610.289421
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 50142.162254
The optimal solution has not been found yet.

Iteration 122
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = -434961.628390 + 127611.024478 = -307350.603912
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 50142.162254
The optimal solution has not been found yet.

Iteration 123
The time to create lower bound problem = 31 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = -436702.002780 + 127262.981495 = -309439.021285
The time to read the lower bound solution = 16 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 15 ms
The time to compute the upper bound = 16 ms
The upper bound solution is:
z = 50049.143535
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 124
The time to create lower bound problem = 15 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = -439087.530000 + 127129.633866 = -311957.896134
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 50049.143535
The optimal solution has not been found yet.

Iteration 125
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 15 ms
The lower bound solution is:
z = -441054.982080 + 127466.484528 = -313588.497552
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 50049.143535
The optimal solution has not been found yet.

Iteration 126
The time to create lower bound problem = 32 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = -443077.891130 + 127631.584152 = -315446.306978
The time to read the lower bound solution = 15 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 50049.143535
The optimal solution has not been found yet.

Iteration 127
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 31 ms
The lower bound solution is:
z = -445095.510680 + 127755.465860 = -317340.044820
The time to read the lower bound solution = 16 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 50049.143535
The optimal solution has not been found yet.

Iteration 128
The time to create lower bound problem = 62 ms
The time to compute the lower bound = 47 ms
The lower bound solution is:
z = -447097.380150 + 127403.244391 = -319694.135759
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 50049.143535
The optimal solution has not been found yet.

Iteration 129
The time to create lower bound problem = 31 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = -449860.721480 + 128143.913447 = -321716.808033
The time to read the lower bound solution = 16 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 50049.143535
The optimal solution has not been found yet.

Iteration 130
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = -452148.949560 + 128631.465412 = -323517.484148
The time to read the lower bound solution = 15 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 50049.143535
The optimal solution has not been found yet.

Iteration 131
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = -454916.064470 + 129171.186626 = -325744.877844
The time to read the lower bound solution = 15 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 50049.143535
The optimal solution has not been found yet.

Iteration 132
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = -457133.215240 + 129477.765366 = -327655.449874
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 15 ms
The time to compute the upper bound = 0 ms
The upper bound solution is:
z = 53748.986104
The time to read the upper bound solution = 16 ms
The optimal solution has not been found yet.

Iteration 133
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = -459696.541770 + 129891.717095 = -329804.824675
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 53748.986104
The optimal solution has not been found yet.

Iteration 134
The time to create lower bound problem = 31 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = -462721.406860 + 130454.543819 = -332266.863041
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 31 ms
The time to compute the upper bound = 0 ms
The upper bound solution is:
z = 50049.143535
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 135
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 15 ms
The lower bound solution is:
z = -465931.308430 + 131185.746031 = -334745.562399
The time to read the lower bound solution = 16 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 16 ms
The time to compute the upper bound = 0 ms
The upper bound solution is:
z = 53748.986104
The time to read the upper bound solution = 15 ms
The optimal solution has not been found yet.

Iteration 136
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 15 ms
The lower bound solution is:
z = -468168.002770 + 130607.887640 = -337560.115130
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 53748.986104
The optimal solution has not been found yet.

Iteration 137
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = -470834.353360 + 130901.346509 = -339933.006851
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 53748.986104
The optimal solution has not been found yet.

Iteration 138
The time to create lower bound problem = 15 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = -476473.245560 + 131399.687214 = -345073.558346
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 31 ms
The time to compute the upper bound = 0 ms
The upper bound solution is:
z = 52234.530325
The time to read the upper bound solution = 16 ms
The optimal solution has not been found yet.

Iteration 139
The time to create lower bound problem = 15 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = -478779.744580 + 131604.787125 = -347174.957455
The time to read the lower bound solution = 16 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 52234.530325
The optimal solution has not been found yet.

Iteration 140
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = -482520.843040 + 132401.257978 = -350119.585062
The time to read the lower bound solution = 15 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 16 ms
The time to compute the upper bound = 0 ms
The upper bound solution is:
z = 53241.530325
The time to read the upper bound solution = 16 ms
The optimal solution has not been found yet.

Iteration 141
The time to create lower bound problem = 15 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = -484703.687440 + 132756.082802 = -351947.604638
The time to read the lower bound solution = 16 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 53241.530325
The optimal solution has not been found yet.

Iteration 142
The time to create lower bound problem = 15 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = -487200.735570 + 133159.411826 = -354041.323744
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 16 ms
The time to compute the upper bound = 15 ms
The upper bound solution is:
z = 52234.530325
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 143
The time to create lower bound problem = 31 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = -489295.240990 + 132731.443689 = -356563.797301
The time to read the lower bound solution = 15 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 16 ms
The time to compute the upper bound = 0 ms
The upper bound solution is:
z = 53748.986104
The time to read the upper bound solution = 16 ms
The optimal solution has not been found yet.

Iteration 144
The time to create lower bound problem = 15 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = -493945.248200 + 133209.493323 = -360735.754877
The time to read the lower bound solution = 16 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 16 ms
The time to compute the upper bound = 0 ms
The upper bound solution is:
z = 53241.530325
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 145
The time to create lower bound problem = 31 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = -496373.007470 + 133550.549090 = -362822.458380
The time to read the lower bound solution = 15 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 16 ms
The time to compute the upper bound = 0 ms
The upper bound solution is:
z = 52234.530325
The time to read the upper bound solution = 16 ms
The optimal solution has not been found yet.

Iteration 146
The time to create lower bound problem = 15 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = -504508.727500 + 134419.619435 = -370089.108065
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 16 ms
The time to compute the upper bound = 0 ms
The upper bound solution is:
z = 52623.162254
The time to read the upper bound solution = 15 ms
The optimal solution has not been found yet.

Iteration 147
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 15 ms
The lower bound solution is:
z = -506865.340490 + 135129.611134 = -371735.729356
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 52623.162254
The optimal solution has not been found yet.

Iteration 148
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = -508855.874540 + 135585.796325 = -373270.078215
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 52623.162254
The optimal solution has not been found yet.

Iteration 149
The time to create lower bound problem = 15 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = -511576.851330 + 136143.233424 = -375433.617906
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 16 ms
The time to compute the upper bound = 15 ms
The upper bound solution is:
z = 53241.530325
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 150
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 15 ms
The lower bound solution is:
z = -514178.154660 + 136736.215123 = -377441.939537
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 53241.530325
The optimal solution has not been found yet.

Iteration 151
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = -517698.096860 + 137432.335237 = -380265.761623
The time to read the lower bound solution = 15 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 16 ms
The time to compute the upper bound = 16 ms
The upper bound solution is:
z = 52105.162254
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 152
The time to create lower bound problem = 15 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = -519596.167860 + 137106.696234 = -382489.471626
The time to read the lower bound solution = 15 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 16 ms
The time to compute the upper bound = 16 ms
The upper bound solution is:
z = 53241.530325
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 153
The time to create lower bound problem = 15 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = -522151.662940 + 137178.148796 = -384973.514144
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 31 ms
The time to compute the upper bound = 16 ms
The upper bound solution is:
z = 50049.143535
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 154
The time to create lower bound problem = 15 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = -524581.747480 + 137575.976434 = -387005.771046
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 31 ms
The time to compute the upper bound = 16 ms
The upper bound solution is:
z = 53748.986104
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 155
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 15 ms
The lower bound solution is:
z = -526553.050670 + 137541.598179 = -389011.452491
The time to read the lower bound solution = 16 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 53748.986104
The optimal solution has not been found yet.

Iteration 156
The time to create lower bound problem = 15 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = -529537.816830 + 137704.760294 = -391833.056536
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 53748.986104
The optimal solution has not been found yet.

Iteration 157
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 15 ms
The lower bound solution is:
z = -541590.931680 + 139173.372360 = -402417.559320
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 16 ms
The time to compute the upper bound = 16 ms
The upper bound solution is:
z = 52623.162254
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 158
The time to create lower bound problem = 15 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = -543901.552250 + 139297.921278 = -404603.630972
The time to read the lower bound solution = 16 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 52623.162254
The optimal solution has not been found yet.

Iteration 159
The time to create lower bound problem = 15 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = -556697.385730 + 140873.400166 = -415823.985564
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 52623.162254
The optimal solution has not been found yet.

Iteration 160
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = -558828.211790 + 141661.246285 = -417166.965505
The time to read the lower bound solution = 15 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 0 ms
The time to compute the upper bound = 32 ms
The upper bound solution is:
z = 52105.162254
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 161
The time to create lower bound problem = 15 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = -561030.634510 + 142529.583625 = -418501.050885
The time to read the lower bound solution = 15 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 52105.162254
The optimal solution has not been found yet.

Iteration 162
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = -562957.716450 + 143095.166874 = -419862.549576
The time to read the lower bound solution = 15 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 52105.162254
The optimal solution has not been found yet.

Iteration 163
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = -564060.867560 + 143514.478895 = -420546.388665
The time to read the lower bound solution = 16 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 52105.162254
The optimal solution has not been found yet.

Iteration 164
The time to create lower bound problem = 15 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = -565057.110930 + 143828.243446 = -421228.867484
The time to read the lower bound solution = 15 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 52105.162254
The optimal solution has not been found yet.

Iteration 165
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = -566223.319690 + 144200.061976 = -422023.257714
The time to read the lower bound solution = 16 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 52105.162254
The optimal solution has not been found yet.

Iteration 166
The time to create lower bound problem = 47 ms
The time to compute the lower bound = 31 ms
The lower bound solution is:
z = -567361.351480 + 144601.558635 = -422759.792845
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 52105.162254
The optimal solution has not been found yet.

Iteration 167
The time to create lower bound problem = 15 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = -568534.809420 + 144998.250285 = -423536.559135
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 52105.162254
The optimal solution has not been found yet.

Iteration 168
The time to create lower bound problem = 31 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = -570025.989770 + 145099.079661 = -424926.910109
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 52105.162254
The optimal solution has not been found yet.

Iteration 169
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 15 ms
The lower bound solution is:
z = -570975.187560 + 145095.260837 = -425879.926723
The time to read the lower bound solution = 94 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 52105.162254
The optimal solution has not been found yet.

Iteration 170
The time to create lower bound problem = 31 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = -572130.094020 + 145305.562015 = -426824.532005
The time to read the lower bound solution = 16 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 52105.162254
The optimal solution has not been found yet.

Iteration 171
The time to create lower bound problem = 15 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = -573045.826070 + 144977.947218 = -428067.878852
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 52105.162254
The optimal solution has not been found yet.

Iteration 172
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 15 ms
The lower bound solution is:
z = -573953.948470 + 145110.093325 = -428843.855145
The time to read the lower bound solution = 16 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 52105.162254
The optimal solution has not been found yet.

Iteration 173
The time to create lower bound problem = 31 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = -575006.781030 + 145359.221306 = -429647.559724
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 52105.162254
The optimal solution has not been found yet.

Iteration 174
The time to create lower bound problem = 15 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = -575870.044450 + 145295.565545 = -430574.478905
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 52105.162254
The optimal solution has not been found yet.

Iteration 175
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 15 ms
The lower bound solution is:
z = -576919.840190 + 145553.967209 = -431365.872981
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 52105.162254
The optimal solution has not been found yet.

Iteration 176
The time to create lower bound problem = 32 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = -578091.555110 + 145836.925346 = -432254.629764
The time to read the lower bound solution = 15 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 52105.162254
The optimal solution has not been found yet.

Iteration 177
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 15 ms
The lower bound solution is:
z = -579221.303930 + 145899.281359 = -433322.022571
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 52105.162254
The optimal solution has not been found yet.

Iteration 178
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = -580137.242690 + 145871.000204 = -434266.242486
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 52105.162254
The optimal solution has not been found yet.

Iteration 179
The time to create lower bound problem = 15 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = -581163.166460 + 146040.563237 = -435122.603223
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 52105.162254
The optimal solution has not been found yet.

Iteration 180
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 15 ms
The lower bound solution is:
z = -582167.579350 + 146142.671068 = -436024.908282
The time to read the lower bound solution = 16 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 52105.162254
The optimal solution has not been found yet.

Iteration 181
The time to create lower bound problem = 15 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = -587112.074470 + 146823.315178 = -440288.759292
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 52105.162254
The optimal solution has not been found yet.

Iteration 182
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 15 ms
The lower bound solution is:
z = -588280.469800 + 147168.768606 = -441111.701194
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 52105.162254
The optimal solution has not been found yet.

Iteration 183
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = -589493.185450 + 147552.663993 = -441940.521457
The time to read the lower bound solution = 15 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 52105.162254
The optimal solution has not been found yet.

Iteration 184
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = -590959.227200 + 148049.594939 = -442909.632261
The time to read the lower bound solution = 15 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 52105.162254
The optimal solution has not been found yet.

Iteration 185
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = -591980.812550 + 148224.527879 = -443756.284671
The time to read the lower bound solution = 16 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 52105.162254
The optimal solution has not been found yet.

Iteration 186
The time to create lower bound problem = 15 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = -593078.563070 + 148435.737269 = -444642.825801
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 52105.162254
The optimal solution has not been found yet.

Iteration 187
The time to create lower bound problem = 47 ms
The time to compute the lower bound = 15 ms
The lower bound solution is:
z = -594130.341230 + 147917.143442 = -446213.197788
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 52105.162254
The optimal solution has not been found yet.

Iteration 188
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = -595171.923370 + 147458.466287 = -447713.457083
The time to read the lower bound solution = 16 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 52105.162254
The optimal solution has not been found yet.

Iteration 189
The time to create lower bound problem = 15 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = -596208.492070 + 147499.992511 = -448708.499559
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 52105.162254
The optimal solution has not been found yet.

Iteration 190
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 15 ms
The lower bound solution is:
z = -597284.468250 + 147572.251669 = -449712.216581
The time to read the lower bound solution = 16 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 52105.162254
The optimal solution has not been found yet.

Iteration 191
The time to create lower bound problem = 15 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = -600663.628100 + 148403.020969 = -452260.607131
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 52105.162254
The optimal solution has not been found yet.

Iteration 192
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 15 ms
The lower bound solution is:
z = -601878.372810 + 148851.417378 = -453026.955432
The time to read the lower bound solution = 16 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 52105.162254
The optimal solution has not been found yet.

Iteration 193
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 15 ms
The lower bound solution is:
z = -603137.496010 + 148926.415087 = -454211.080923
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 52105.162254
The optimal solution has not been found yet.

Iteration 194
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 15 ms
The lower bound solution is:
z = -604163.113740 + 149155.763258 = -455007.350482
The time to read the lower bound solution = 16 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 52105.162254
The optimal solution has not been found yet.

Iteration 195
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 15 ms
The lower bound solution is:
z = -605313.558090 + 149324.559152 = -455988.998938
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 52105.162254
The optimal solution has not been found yet.

Iteration 196
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = -606382.642110 + 149505.756385 = -456876.885725
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 52105.162254
The optimal solution has not been found yet.

Iteration 197
The time to create lower bound problem = 31 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = -607445.957600 + 149620.811236 = -457825.146364
The time to read the lower bound solution = 15 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 52105.162254
The optimal solution has not been found yet.

Iteration 198
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = -608549.112910 + 149170.040623 = -459379.072287
The time to read the lower bound solution = 16 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 15 ms
The time to compute the upper bound = 16 ms
The upper bound solution is:
z = 51056.143535
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 199
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 15 ms
The lower bound solution is:
z = -609898.555260 + 149428.730684 = -460469.824576
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 31 ms
The time to compute the upper bound = 0 ms
The upper bound solution is:
z = 51098.162254
The time to read the upper bound solution = 16 ms
The optimal solution has not been found yet.

Iteration 200
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 15 ms
The lower bound solution is:
z = -611082.225890 + 149543.301055 = -461538.924835
The time to read the lower bound solution = 16 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 16 ms
The time to compute the upper bound = 15 ms
The upper bound solution is:
z = 50049.143535
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 201
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 15 ms
The lower bound solution is:
z = -612350.781960 + 149454.250458 = -462896.531502
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 50049.143535
The optimal solution has not been found yet.

Iteration 202
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = -613469.441480 + 149484.017195 = -463985.424285
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 50049.143535
The optimal solution has not been found yet.

Iteration 203
The time to create lower bound problem = 15 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = -614762.145130 + 149707.083685 = -465055.061445
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 50049.143535
The optimal solution has not been found yet.

Iteration 204
The time to create lower bound problem = 31 ms
The time to compute the lower bound = 47 ms
The lower bound solution is:
z = -616269.979490 + 149963.985891 = -466305.993599
The time to read the lower bound solution = 16 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 50049.143535
The optimal solution has not been found yet.

Iteration 205
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = -617359.828990 + 149828.185421 = -467531.643569
The time to read the lower bound solution = 15 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 50049.143535
The optimal solution has not been found yet.

Iteration 206
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = -618899.889790 + 150083.186423 = -468816.703367
The time to read the lower bound solution = 15 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 0 ms
The time to compute the upper bound = 16 ms
The upper bound solution is:
z = 52234.530325
The time to read the upper bound solution = 16 ms
The optimal solution has not been found yet.

Iteration 207
The time to create lower bound problem = 15 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = -620381.728280 + 150322.145511 = -470059.582769
The time to read the lower bound solution = 16 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 16 ms
The time to compute the upper bound = 15 ms
The upper bound solution is:
z = 50049.143535
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 208
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 15 ms
The lower bound solution is:
z = -621405.367710 + 150288.915599 = -471116.452111
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 50049.143535
The optimal solution has not been found yet.

Iteration 209
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = -626948.421370 + 151090.813968 = -475857.607402
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 15 ms
The time to compute the upper bound = 16 ms
The upper bound solution is:
z = 52623.162254
The time to read the upper bound solution = 16 ms
The optimal solution has not been found yet.

Iteration 210
The time to create lower bound problem = 15 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = -627840.917030 + 151258.555736 = -476582.361294
The time to read the lower bound solution = 15 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 52623.162254
The optimal solution has not been found yet.

Iteration 211
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = -628898.965960 + 151514.644213 = -477384.321747
The time to read the lower bound solution = 16 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 52623.162254
The optimal solution has not been found yet.

Iteration 212
The time to create lower bound problem = 15 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = -629971.031940 + 151769.494890 = -478201.537050
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 16 ms
The time to compute the upper bound = 16 ms
The upper bound solution is:
z = 52105.162254
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 213
The time to create lower bound problem = 15 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = -631008.788520 + 151933.954727 = -479074.833793
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 52105.162254
The optimal solution has not been found yet.

Iteration 214
The time to create lower bound problem = 31 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = -632081.066260 + 152029.524742 = -480051.541518
The time to read the lower bound solution = 15 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 16 ms
The time to compute the upper bound = 16 ms
The upper bound solution is:
z = 51056.143535
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 215
The time to create lower bound problem = 31 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = -633275.582290 + 152128.553218 = -481147.029072
The time to read the lower bound solution = 15 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 51056.143535
The optimal solution has not been found yet.

Iteration 216
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = -634550.998120 + 152233.358364 = -482317.639756
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 16 ms
The time to compute the upper bound = 15 ms
The upper bound solution is:
z = 50049.143535
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 217
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = -635698.231100 + 152393.046511 = -483305.184589
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 50049.143535
The optimal solution has not been found yet.

Iteration 218
The time to create lower bound problem = 15 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = -637151.238680 + 152548.537536 = -484602.701144
The time to read the lower bound solution = 15 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 16 ms
The time to compute the upper bound = 16 ms
The upper bound solution is:
z = 53748.986104
The time to read the upper bound solution = 15 ms
The optimal solution has not been found yet.

Iteration 219
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = -638222.899490 + 152602.231488 = -485620.668002
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 53748.986104
The optimal solution has not been found yet.

Iteration 220
The time to create lower bound problem = 31 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = -639543.748510 + 152807.221691 = -486736.526819
The time to read the lower bound solution = 15 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 16 ms
The time to compute the upper bound = 0 ms
The upper bound solution is:
z = 64299.703226
The time to read the upper bound solution = 16 ms
The optimal solution has not been found yet.

Iteration 221
The time to create lower bound problem = 15 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = -640931.419900 + 152951.030132 = -487980.389768
The time to read the lower bound solution = 16 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 64299.703226
The optimal solution has not been found yet.

Iteration 222
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = -643428.190760 + 153215.750483 = -490212.440277
The time to read the lower bound solution = 15 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 16 ms
The time to compute the upper bound = 0 ms
The upper bound solution is:
z = 52105.162254
The time to read the upper bound solution = 15 ms
The optimal solution has not been found yet.

Iteration 223
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = -647990.344450 + 153628.802251 = -494361.542199
The time to read the lower bound solution = 15 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 16 ms
The time to compute the upper bound = 16 ms
The upper bound solution is:
z = 52623.162254
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 224
The time to create lower bound problem = 15 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = -651047.315470 + 153942.002130 = -497105.313340
The time to read the lower bound solution = 16 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 52623.162254
The optimal solution has not been found yet.

Iteration 225
The time to create lower bound problem = 15 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = -652436.587090 + 154407.537697 = -498029.049393
The time to read the lower bound solution = 16 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 0 ms
The time to compute the upper bound = 15 ms
The upper bound solution is:
z = 52105.162254
The time to read the upper bound solution = 16 ms
The optimal solution has not been found yet.

Iteration 226
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = -653691.278450 + 154834.460820 = -498856.817630
The time to read the lower bound solution = 15 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 52105.162254
The optimal solution has not been found yet.

Iteration 227
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 15 ms
The lower bound solution is:
z = -655604.887520 + 155364.008546 = -500240.878974
The time to read the lower bound solution = 16 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 52105.162254
The optimal solution has not been found yet.

Iteration 228
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 15 ms
The lower bound solution is:
z = -657414.247150 + 155880.863752 = -501533.383398
The time to read the lower bound solution = 16 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 52105.162254
The optimal solution has not been found yet.

Iteration 229
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 15 ms
The lower bound solution is:
z = -658412.258420 + 155902.215617 = -502510.042803
The time to read the lower bound solution = 16 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 52105.162254
The optimal solution has not been found yet.

Iteration 230
The time to create lower bound problem = 15 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = -660171.556710 + 156489.384382 = -503682.172328
The time to read the lower bound solution = 16 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 52105.162254
The optimal solution has not been found yet.

Iteration 231
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = -662800.072780 + 156925.459842 = -505874.612938
The time to read the lower bound solution = 15 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 16 ms
The time to compute the upper bound = 0 ms
The upper bound solution is:
z = 52623.162254
The time to read the upper bound solution = 16 ms
The optimal solution has not been found yet.

Iteration 232
The time to create lower bound problem = 15 ms
The time to compute the lower bound = 31 ms
The lower bound solution is:
z = -663749.658710 + 157145.466246 = -506604.192464
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 52623.162254
The optimal solution has not been found yet.

Iteration 233
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = -664496.579760 + 156677.933251 = -507818.646509
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 52623.162254
The optimal solution has not been found yet.

Iteration 234
The time to create lower bound problem = 15 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = -665637.932420 + 156830.420396 = -508807.512024
The time to read the lower bound solution = 16 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 15 ms
The time to compute the upper bound = 0 ms
The upper bound solution is:
z = 52105.162254
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 235
The time to create lower bound problem = 31 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = -666614.571320 + 156891.400267 = -509723.171053
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 52105.162254
The optimal solution has not been found yet.

Iteration 236
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = -668117.698800 + 157073.490453 = -511044.208347
The time to read the lower bound solution = 15 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 52105.162254
The optimal solution has not been found yet.

Iteration 237
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 31 ms
The lower bound solution is:
z = -669110.537610 + 157205.385821 = -511905.151789
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 52105.162254
The optimal solution has not been found yet.

Iteration 238
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 15 ms
The lower bound solution is:
z = -670189.673660 + 157362.618865 = -512827.054795
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 52105.162254
The optimal solution has not been found yet.

Iteration 239
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = -673663.309400 + 157960.696787 = -515702.612613
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 52105.162254
The optimal solution has not been found yet.

Iteration 240
The time to create lower bound problem = 31 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = -678508.226270 + 159056.233758 = -519451.992512
The time to read the lower bound solution = 16 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 15 ms
The time to compute the upper bound = 0 ms
The upper bound solution is:
z = 52623.162254
The time to read the upper bound solution = 16 ms
The optimal solution has not been found yet.

Iteration 241
The time to create lower bound problem = 31 ms
The time to compute the lower bound = 31 ms
The lower bound solution is:
z = -679450.880670 + 159099.036330 = -520351.844340
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 16 ms
The time to compute the upper bound = 16 ms
The upper bound solution is:
z = 52105.162254
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 242
The time to create lower bound problem = 15 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = -679895.008210 + 159135.594619 = -520759.413591
The time to read the lower bound solution = 15 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 52105.162254
The optimal solution has not been found yet.

Iteration 243
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = -680373.262450 + 159099.174093 = -521274.088357
The time to read the lower bound solution = 31 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 52105.162254
The optimal solution has not been found yet.

Iteration 244
The time to create lower bound problem = 47 ms
The time to compute the lower bound = 31 ms
The lower bound solution is:
z = -680815.675060 + 159008.242477 = -521807.432583
The time to read the lower bound solution = 16 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 52105.162254
The optimal solution has not been found yet.

Iteration 245
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 15 ms
The lower bound solution is:
z = -681313.880970 + 159034.927166 = -522278.953804
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 52105.162254
The optimal solution has not been found yet.

Iteration 246
The time to create lower bound problem = 32 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = -681819.267510 + 159079.588396 = -522739.679114
The time to read the lower bound solution = 15 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 52105.162254
The optimal solution has not been found yet.

Iteration 247
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 15 ms
The lower bound solution is:
z = -682646.317250 + 159282.515040 = -523363.802210
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 52105.162254
The optimal solution has not been found yet.

Iteration 248
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = -683227.339430 + 159404.565883 = -523822.773547
The time to read the lower bound solution = 15 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 52105.162254
The optimal solution has not been found yet.

Iteration 249
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = -683749.353660 + 159494.129868 = -524255.223792
The time to read the lower bound solution = 16 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 52105.162254
The optimal solution has not been found yet.

Iteration 250
The time to create lower bound problem = 15 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = -684288.010870 + 159581.048873 = -524706.961997
The time to read the lower bound solution = 15 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 52105.162254
The optimal solution has not been found yet.

Iteration 251
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = -684809.931620 + 159609.560841 = -525200.370779
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 52105.162254
The optimal solution has not been found yet.

Iteration 252
The time to create lower bound problem = 15 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = -685916.043080 + 159995.039814 = -525921.003266
The time to read the lower bound solution = 16 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 52105.162254
The optimal solution has not been found yet.

Iteration 253
The time to create lower bound problem = 15 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = -686459.355170 + 160082.689825 = -526376.665345
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 52105.162254
The optimal solution has not been found yet.

Iteration 254
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 47 ms
The lower bound solution is:
z = -686981.980460 + 160157.987960 = -526823.992500
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 52105.162254
The optimal solution has not been found yet.

Iteration 255
The time to create lower bound problem = 15 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = -687806.120310 + 160326.334544 = -527479.785766
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 52105.162254
The optimal solution has not been found yet.

Iteration 256
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 15 ms
The lower bound solution is:
z = -688684.250590 + 160435.956577 = -528248.294013
The time to read the lower bound solution = 16 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 52105.162254
The optimal solution has not been found yet.

Iteration 257
The time to create lower bound problem = 0 ms
The time to compute the lower bound = 15 ms
The lower bound solution is:
z = -689310.899150 + 160646.168535 = -528664.730615
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 52105.162254
The optimal solution has not been found yet.

Iteration 258
The time to create lower bound problem = 32 ms
The time to compute the lower bound = 15 ms
The lower bound solution is:
z = -689771.616370 + 160675.213039 = -529096.403331
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 52105.162254
The optimal solution has not been found yet.

Iteration 259
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = -690287.052420 + 160741.232604 = -529545.819816
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 52105.162254
The optimal solution has not been found yet.

Iteration 260
The time to create lower bound problem = 15 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = -690812.335820 + 160756.318980 = -530056.016840
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 94 ms
The time to compute the upper bound = 0 ms
The upper bound solution is:
z = 51056.143535
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 261
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = -691312.442280 + 160739.219917 = -530573.222363
The time to read the lower bound solution = 15 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 51056.143535
The optimal solution has not been found yet.

Iteration 262
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = -691857.525650 + 160800.251071 = -531057.274579
The time to read the lower bound solution = 16 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 51056.143535
The optimal solution has not been found yet.

Iteration 263
The time to create lower bound problem = 15 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = -692252.141870 + 160713.113698 = -531539.028172
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 51056.143535
The optimal solution has not been found yet.

Iteration 264
The time to create lower bound problem = 46 ms
The time to compute the lower bound = 32 ms
The lower bound solution is:
z = -692764.511190 + 160680.720169 = -532083.791021
The time to read the lower bound solution = 15 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 0 ms
The time to compute the upper bound = 32 ms
The upper bound solution is:
z = 50049.143535
The time to read the upper bound solution = 15 ms
The optimal solution has not been found yet.

Iteration 265
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 15 ms
The lower bound solution is:
z = -693255.856870 + 160657.699746 = -532598.157124
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 50049.143535
The optimal solution has not been found yet.

Iteration 266
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = -694334.369790 + 160951.186092 = -533383.183698
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 15 ms
The time to compute the upper bound = 16 ms
The upper bound solution is:
z = 51098.162254
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 267
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 15 ms
The lower bound solution is:
z = -694749.603540 + 160935.953528 = -533813.650012
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 51098.162254
The optimal solution has not been found yet.

Iteration 268
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 15 ms
The lower bound solution is:
z = -695237.876150 + 160901.666186 = -534336.209964
The time to read the lower bound solution = 16 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 16 ms
The time to compute the upper bound = 0 ms
The upper bound solution is:
z = 50049.143535
The time to read the upper bound solution = 15 ms
The optimal solution has not been found yet.

Iteration 269
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = -695811.999500 + 160931.201559 = -534880.797941
The time to read the lower bound solution = 15 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 50049.143535
The optimal solution has not been found yet.

Iteration 270
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = -696456.011920 + 160940.267701 = -535515.744219
The time to read the lower bound solution = 15 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 16 ms
The time to compute the upper bound = 0 ms
The upper bound solution is:
z = 52234.530325
The time to read the upper bound solution = 16 ms
The optimal solution has not been found yet.

Iteration 271
The time to create lower bound problem = 15 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = -697053.750000 + 160893.341798 = -536160.408202
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 16 ms
The time to compute the upper bound = 15 ms
The upper bound solution is:
z = 51056.143535
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 272
The time to create lower bound problem = 15 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = -697515.351780 + 160737.632481 = -536777.719299
The time to read the lower bound solution = 16 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 15 ms
The time to compute the upper bound = 16 ms
The upper bound solution is:
z = 53748.986104
The time to read the upper bound solution = 16 ms
The optimal solution has not been found yet.

Iteration 273
The time to create lower bound problem = 15 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = -698057.913290 + 160729.125321 = -537328.787969
The time to read the lower bound solution = 15 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 53748.986104
The optimal solution has not been found yet.

Iteration 274
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = -698711.750770 + 160829.280724 = -537882.470046
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 15 ms
The time to compute the upper bound = 0 ms
The upper bound solution is:
z = 64299.703226
The time to read the upper bound solution = 16 ms
The optimal solution has not been found yet.

Iteration 275
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = -699293.400210 + 160784.287865 = -538509.112345
The time to read the lower bound solution = 15 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 64299.703226
The optimal solution has not been found yet.

Iteration 276
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = -700625.006880 + 161190.996376 = -539434.010504
The time to read the lower bound solution = 15 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 0 ms
The time to compute the upper bound = 16 ms
The upper bound solution is:
z = 52691.278375
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 277
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 15 ms
The lower bound solution is:
z = -701240.907620 + 161260.863174 = -539980.044446
The time to read the lower bound solution = 16 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 16 ms
The time to compute the upper bound = 15 ms
The upper bound solution is:
z = 64299.703226
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 278
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 15 ms
The lower bound solution is:
z = -701884.956990 + 161317.226767 = -540567.730223
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 16 ms
The time to compute the upper bound = 16 ms
The upper bound solution is:
z = 52691.278375
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 279
The time to create lower bound problem = 15 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = -702537.322240 + 161339.171988 = -541198.150252
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 16 ms
The time to compute the upper bound = 0 ms
The upper bound solution is:
z = 64299.703226
The time to read the upper bound solution = 15 ms
The optimal solution has not been found yet.

Iteration 280
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 15 ms
The lower bound solution is:
z = -703170.752960 + 161299.538127 = -541871.214833
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 64299.703226
The optimal solution has not been found yet.

Iteration 281
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = -703747.281280 + 161231.168727 = -542516.112553
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 64299.703226
The optimal solution has not been found yet.

Iteration 282
The time to create lower bound problem = 15 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = -704402.702610 + 161237.036935 = -543165.665675
The time to read the lower bound solution = 16 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 64299.703226
The optimal solution has not been found yet.

Iteration 283
The time to create lower bound problem = 15 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = -705003.403100 + 161173.495655 = -543829.907445
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 64299.703226
The optimal solution has not been found yet.

Iteration 284
The time to create lower bound problem = 15 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = -705573.105430 + 161025.238790 = -544547.866640
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 64299.703226
The optimal solution has not been found yet.

Iteration 285
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 15 ms
The lower bound solution is:
z = -706215.186630 + 160802.905002 = -545412.281628
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 64299.703226
The optimal solution has not been found yet.

Iteration 286
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = -706839.838980 + 160813.468719 = -546026.370261
The time to read the lower bound solution = 15 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 64299.703226
The optimal solution has not been found yet.

Iteration 287
The time to create lower bound problem = 31 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = -707488.322360 + 160788.272463 = -546700.049897
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 64299.703226
The optimal solution has not been found yet.

Iteration 288
The time to create lower bound problem = 31 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = -708160.056690 + 160839.137505 = -547320.919185
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 64299.703226
The optimal solution has not been found yet.

Iteration 289
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 15 ms
The lower bound solution is:
z = -708971.050180 + 161068.822326 = -547902.227854
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 64299.703226
The optimal solution has not been found yet.

Iteration 290
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 15 ms
The lower bound solution is:
z = -709587.749140 + 160794.414562 = -548793.334578
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 64299.703226
The optimal solution has not been found yet.

Iteration 291
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = -710473.798250 + 161024.484221 = -549449.314029
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 64299.703226
The optimal solution has not been found yet.

Iteration 292
The time to create lower bound problem = 15 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = -711049.177090 + 161048.035182 = -550001.141908
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 64299.703226
The optimal solution has not been found yet.

Iteration 293
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 15 ms
The lower bound solution is:
z = -711656.294130 + 161016.359800 = -550639.934330
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 64299.703226
The optimal solution has not been found yet.

Iteration 294
The time to create lower bound problem = 31 ms
The time to compute the lower bound = 32 ms
The lower bound solution is:
z = -712308.312170 + 161089.197045 = -551219.115125
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 64299.703226
The optimal solution has not been found yet.

Iteration 295
The time to create lower bound problem = 15 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = -712986.212410 + 161182.881388 = -551803.331022
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 64299.703226
The optimal solution has not been found yet.

Iteration 296
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 15 ms
The lower bound solution is:
z = -713586.825690 + 161125.237920 = -552461.587770
The time to read the lower bound solution = 16 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 15 ms
The time to compute the upper bound = 0 ms
The upper bound solution is:
z = 52691.278375
The time to read the upper bound solution = 16 ms
The optimal solution has not been found yet.

Iteration 297
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = -714499.829980 + 161272.879986 = -553226.949994
The time to read the lower bound solution = 15 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 0 ms
The time to compute the upper bound = 16 ms
The upper bound solution is:
z = 53748.986104
The time to read the upper bound solution = 16 ms
The optimal solution has not been found yet.

Iteration 298
The time to create lower bound problem = 15 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = -715020.158520 + 161235.963420 = -553784.195100
The time to read the lower bound solution = 16 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 15 ms
The time to compute the upper bound = 0 ms
The upper bound solution is:
z = 64299.703226
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 299
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 15 ms
The lower bound solution is:
z = -716899.559020 + 161573.711732 = -555325.847288
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 16 ms
The time to compute the upper bound = 16 ms
The upper bound solution is:
z = 51098.162254
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 300
The time to create lower bound problem = 15 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = -717429.930510 + 161624.526300 = -555805.404210
The time to read the lower bound solution = 15 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 51098.162254
The optimal solution has not been found yet.
The iteration limit has been reached

TIMINGS:

Total run time for the heuristic = 417093 ms
The total time to calculate the lower bounds with CPLEX = 3957 ms
The total time to calculate the upper bounds with CPLEX = 1099 ms
The total time to create the lower bound problems = 5492 ms
The total time to read the lower bound solutions = 2128 ms
The total time to check if computing the upper bounds are needed = 16 ms
The total time to create the upper bound problems = 1601 ms
The total time to read the upper bound solutions = 627 ms 

The best upper bound found = 44583.143535, the best lower bound found = 13553.661279
Therefore the duality gap is 228.938009%
